Attacking and Repairing Batch Verification Schemes

نویسندگان

  • Colin Boyd
  • Chris Pavlovski
چکیده

Batch verification can provide large computational savings when several signatures, or other constructs, are verified together. Several batch verification algorithms have been published in recent years, in particular for both DSA-type and RSA signatures. We describe new attacks on several of these published schemes. A general weakness is explained which applies to almost all known batch verifiers for discrete logarithm based signature schemes. It is shown how this weakness can be eliminated given extra properties about the underlying group structure. A new general batch verifier for exponentiation in any cyclic group is also described as well as a batch verifier for modified RSA signatures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Security of a Secure Batch Verification with Group Testing for VANET

Vehicular communication networking can provide wellsuited traffic messages, emergency warning messages and infotainment dissemination, and improve driving condition for drivers. The authentication of these information is particularly important in VANET since the wrong traffic information may result in traffic accident and traffic jam. And VANET requires short verifying delay to response message...

متن کامل

Attacking LCCC Batch Verification of RSA Signatures

Batch verification of digital signatures is used to improve the computational complexity when large number of digital signatures must be verified. Lee at al. [2] proposed a new method to identify bad signatures in batches efficiently. We show that the method is flawed.

متن کامل

Security Analysis of Some Batch Verifying Signatures from Pairings

Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from bilinear pairings. In this paper, we show that an attacker can cheat a verifier to accept invalid signatures in these batch verifying schemes. We also show that randomized batch verification technique can be used to a...

متن کامل

Research Issues and Challenges for Multiple Digital Signatures

In this paper, we surveyed several well-known batch verification multiple digital signatures. These schemes can batch verify multiple digital signatures which need only one verification instead of t verifications. However, a number of weaknesses of these schemes are pointed out. According to our proposed issues and challenges, we compared and analyzed them. To sum up these schemes, a secure and...

متن کامل

Batch Verifications with ID-Based Signatures

An identity (ID)-based signature scheme allows any pair of users to verify each other’s signatures without exchanging public key certificates. With the advent of Bilinear maps, several ID-based signatures based on the discrete logarithm problem have been proposed. While these signatures have an advantage in the fact that the system secret can be shared by several parties using a threshold schem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000